// Copyright (C) Kumo inc. and its affiliates.
// Author: Jeff.li lijippy@163.com
// All rights reserved.
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU Affero General Public License as published
// by the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU Affero General Public License for more details.
//
// You should have received a copy of the GNU Affero General Public License
// along with this program.  If not, see <https://www.gnu.org/licenses/>.
//


// Adapted from Apache Arrow.

#include "xx_hasher.h"

#define XXH_INLINE_ALL
#include <xxhash.h>

namespace kumo::pollux::parquet {
    namespace {
        template<typename T>
        uint64_t XxHashHelper(T value, uint32_t seed) {
            return XXH64(reinterpret_cast<const void *>(&value), sizeof(T), seed);
        }

        template<typename T>
        void XxHashesHelper(
            const T *values,
            uint32_t seed,
            int numValues,
            uint64_t *results) {
            for (int i = 0; i < numValues; ++i) {
                results[i] = XxHashHelper(values[i], seed);
            }
        }
    } // namespace

    uint64_t XxHasher::hash(int32_t value) const {
        return XxHashHelper(value, kParquetBloomXxHashSeed);
    }

    uint64_t XxHasher::hash(int64_t value) const {
        return XxHashHelper(value, kParquetBloomXxHashSeed);
    }

    uint64_t XxHasher::hash(float value) const {
        return XxHashHelper(value, kParquetBloomXxHashSeed);
    }

    uint64_t XxHasher::hash(double value) const {
        return XxHashHelper(value, kParquetBloomXxHashSeed);
    }

    uint64_t XxHasher::hash(const ByteArray *value) const {
        return XXH64(
            reinterpret_cast<const void *>(value->ptr),
            value->len,
            kParquetBloomXxHashSeed);
    }

    void XxHasher::hashes(const int32_t *values, int numValues, uint64_t *hashes)
    const {
        XxHashesHelper(values, kParquetBloomXxHashSeed, numValues, hashes);
    }

    void XxHasher::hashes(const int64_t *values, int numValues, uint64_t *hashes)
    const {
        XxHashesHelper(values, kParquetBloomXxHashSeed, numValues, hashes);
    }

    void XxHasher::hashes(const float *values, int numValues, uint64_t *hashes)
    const {
        XxHashesHelper(values, kParquetBloomXxHashSeed, numValues, hashes);
    }

    void XxHasher::hashes(const double *values, int numValues, uint64_t *hashes)
    const {
        XxHashesHelper(values, kParquetBloomXxHashSeed, numValues, hashes);
    }

    void XxHasher::hashes(const ByteArray *values, int numValues, uint64_t *hashes)
    const {
        for (int i = 0; i < numValues; ++i) {
            hashes[i] = XXH64(
                reinterpret_cast<const void *>(values[i].ptr),
                values[i].len,
                kParquetBloomXxHashSeed);
        }
    }
} // namespace kumo::pollux::parquet
